Minimalism, justification and non-monotonicity in deductive databases
نویسندگان
چکیده
منابع مشابه
Non-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with ...
متن کاملNon-Monotonic Negation in Probabilistic Deductive Databases
In this paper we study tlw uses and the se mantics of non-monotonic negation in prob abilistic deductive databases. Based on the stahl<semantics for classical logic program ming, we in I roduce the notion of stable for mula functions. We show that. stable for mula functions are minimal fixpoints of op erators associated with probabilistic dednc1 ive databases with negation. Furthermore, s...
متن کاملNon-commutativity and Expressive Deductive Logic Databases
The procedural semantics of multi-adjoint logic programming is used for providing a model-theoretic semantics for a data model. A translation method for deductive logic databases is presented for obtaining a relational algebra with classical projection and enriched parametric join operator with aggregations. The use of non-commutative conjunctors allows for a model of different degrees of granu...
متن کاملA minimal deductive system for minimalism
This paper proposes to answer some questions concerning economy in computation and language by giving a very compact set of deductive rules (based on the so-called Lambek calculus, enriched with an exchange modality) which embodies all the properties of Minimalist Grammars (Stabler, 15]). move is replaced by a logical operation, very similar in its eeects to Form Chain, technically known as the...
متن کاملUncertainty and Partial Non-uniform Assumptions in Parametric Deductive Databases
Different many-valued logic programming frameworks have been proposed to manage uncertain information in deductive databases and logic programming. A feature of these frameworks is that they rely on a predefined assumption or hypothesis, i.e. an interpretation that assigns the same default truth value to all the atoms of a program, e.g. in the open world assumption, by default all atoms have un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90004-4